Improved approximation algorithms for scheduling parallel jobs on identical clusters
نویسندگان
چکیده
منابع مشابه
Improved approximation algorithms for scheduling parallel jobs on identical clusters
The Multiple Cluster Scheduling Problem corresponds to minimize the maximum completion time (makespan) of a set of n parallel rigid (and non-preemptive) jobs submitted to N identical clusters. It cannot be approximated with a ratio better than 2 (unless P = NP). We present in this paper the methodology that encompasses several existing results [1, 2]. We detail first how to apply it for obtaini...
متن کاملTight Approximation for Scheduling Parallel Job on Identical Clusters
In the grid computing paradigm, several clusters share their computing resources in order to distribute the workload. Each of the N cluster is a set of m identical processors (connected by a local interconnection network), and n parallel jobs are submitted to a centralized queue. A job Jj requires qj processors during pj units of time. We consider the Multiple Cluster Scheduling Problem (MCSP )...
متن کاملImproved approximation algorithms for scheduling with fixed jobs
We study two closely related problems in non-preemptive scheduling of sequential jobs on identical parallel machines. In these two settings there are either fixed jobs or nonavailability intervals during which the machines are not available; in either case, the objective is to minimize the makespan. Both formulations have different applications, e.g. in turnaround scheduling or overlay computin...
متن کاملHeuristic Algorithms For Scheduling Jobs On Identical Parallel Machines Via Measures Of Spread
Constructive heuristics for the scheduling problem of n independent jobs on m identical parallel machines with minimum makespan objective are described. The proposed algorithms, which are n log n algorithms as the LPT algorithm of Graham, iteratively combine partial solutions that are obtained by partitioning the set of jobs into suitable families of subsets. The procedure used to partition the...
متن کاملOnline scheduling of two type parallel jobs on identical machines
In this paper we consider an online scheduling of parallel jobs with preemption on identical machines, where jobs arrive over time. The objective is to minimize the makespan. For the problem that jobs have only two possible widths mj = 1 or m, we present an optimal online algorithm by using " temporary schedule " .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.07.003